Locally linear constraint based optimization model for material decomposition
نویسندگان
چکیده
منابع مشابه
Optimization Based Domain Decomposition Methods for Linear and Nonlinear Problems
(ABSTRACT) Optimization based domain decomposition methods for the solution of partial differential equations are considered. The crux of the method is a constrained minimization problem for which the objective functional measures the jump in the dependent variables across the common boundaries between subdomains; the constraints are the partial differential equations. First, we consider a line...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملLocally Optimal Algorithms and Solutions for Distributed Constraint Optimization
This paper summarizes the author’s recent work in distributed constraint optimization (DCOP). New local algorithms, as well as theoretical results about the types of solutions that these algorithms can reach, are discussed.
متن کاملOptimal Decomposition in Linear Constraint Systems
Decomposition is a technique to obtain complete solutions by assembling independently obtained partial solutions. In particular, constraint decomposition plays an important role in distributed databases, distributed scheduling and violation detection: It enables conflictfree local decision making, while avoiding communication overloading. One of the main issues in decomposition is the loss of f...
متن کاملExploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP’s) the standard technique of invoking a separate recursion to solve each independent component can significantly reduce the strength of the bounds that can be applied when using branch and bound techniques. In this paper we present a new search a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics in Medicine & Biology
سال: 2017
ISSN: 1361-6560
DOI: 10.1088/1361-6560/aa8e13